Optimal routing of infiltration operations

This paper suggests a method for routing military ground operations, focused on conducting infiltration based on the shortest-path method. We model the problem in four parts. First, we estimate enemy locations by using public facility location model and military data, and use these to define possible enemy scenarios. Second, for each scenario, a shortest-path problem is solved, where each link’s cost is given by both BSpeed^ (Travel time) and BSurprise^ (Detection probability). And the detection probability is jointly determined by the distance from the enemy’s closest location, detection device’s location and concealment probability from vegetation information. Third, the preferred solution is selected by a robust optimization process. The fourth step involves the use of dissimilar paths to incorporate the impact of a deception operation. The methodology is demonstrated by a case study that uses realistic data from South Korea.